On the Security of a Variation of Cramer-Shoup's Public Key Scheme
نویسنده
چکیده
At Crypto’98, Cramer and Shoup [1] proposed a public key cryptosystem that is provably secure against the adaptive chosen ciphertext attacks. Recently, Zhu, Chan, and Deng [2] proposed a variation of Cramer and Shoup’s scheme (the Zhu-Chan-Deng scheme in short) which attempts to reduce Cramer and Shoup’s public key cryptosystem in terms of both the size of the ciphertext and the computation required for decryption. However, in this paper, we show that the Zhu-Chan-Deng scheme is insecure against the adaptive chosen ciphertext attacks. Moreover, we also show that the Zhu-Chan-Deng scheme doesn’t exhibit the non-malleability property, even under the weakest attack model the chosen plaintext attack.
منابع مشابه
Provably Secure Length-saving Public-key Encryption Scheme under the Computational Diie-hellman Assumption
A design of secure and eecient public-key encryption schemes under weaker computational assumptions has been regarded as an important and challenging task. As far as ElGamal-type encryption schemes are concerned, some variants of the original ElGamal encryption scheme based on the weaker computational assumption have been proposed. For instance, security of the ElGamal variant of Fujisaki-Okamo...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملA Public Key Encryption In Standard Model Using Cramer-Shoup Paradigm
We present a public-key encryption scheme which is provably secure against adaptive chosen ciphertext attack. The scheme is constructed using Cramer-Shoup paradigm [7]. The security of the scheme is based on the Decisional Bilinear Diffie-Hellman problem.
متن کاملAn Adaptive Chosen Ciphertext Attack on a Variation of the Cramer-shoup Public-key Encryption Scheme
In this letter we show that the variation of the Cramer-Shoup public-key encryption scheme as introduced in 1] is not secure against an adaptive chosen ciphertext attack. This removes the putative main advantage of the scheme. Introduction: In 1] a new public-key encryption scheme was proposed. It is a (sim
متن کاملAn efficient certificateless signcryption scheme in the standard model
Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 18 شماره
صفحات -
تاریخ انتشار 2002